Linear Connections on Graphs
نویسندگان
چکیده
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by extending the work of Dimakis et al and discuss linear connections and curvatures on graphs. Especially, we calculate connections and curvatures explicitly for the general nonzero torsion case. Several examples are given.
منابع مشابه
Non-Linear Behavior of New (FSFN) Moment Resisting Connections in Comparison to the Existing KBB Connections in Steel Frames
After Northridge (1994) and Kobe (1995) earthquakes, several studies have been conducted to improve the seismic performance of steel structures. In this investigation, new steel moment-resisting connections (FSFN) developed by the authors, were studied by the non-linear numerical analysis. These connections were single-sided beam-to-column assemblies that are representative of exterior beam-to-...
متن کاملNonlinear inelastic dynamic analysis of space steel frames with semi-rigid connections in urban buildings
Applied studies addressing semi-rigid connections have been limited. Scant information exists in regulations except little brief information. Therefore, this research analyzes the behavior of three-dimensional steel frames and semi-rigid connections based on beam-column method and non-linear dynamic analysis. Stability functions and geometric stiffness matrix were used to study the non-linear g...
متن کاملOn the linear algebra of local complementation
We survey the connections between the linear algebra of symmetric matrices over GF (2) and the circuit theory of 4-regular graphs. In particular, we show that the equivalence relation on simple graphs generated by local complementation can also be generated by an operation defined using inverse matrices.
متن کاملConnections between labellings of trees
There are many long-standing conjectures related with some labellings of trees. It is important to connect labellings that are related with conjectures. We find some connections between known labellings of simple graphs.
متن کاملOnly the source's and sink's neighborhood matters: convergence results for unicast and multicast connections on random graphs and hypergraphs
We study the maximum flow on random weighted directed graphs and hypergraphs, that generalize Erdös-Rényi graphs. We show that, for a single unicast connection chosen at random, its capacity, determined by the max-flow between source and sink, converges in probability to the capacity around the source or sink. Using results from network coding, we generalize this result to different types multi...
متن کامل